The δ-squared process and Fourier series of functions with multiple jumps
نویسندگان
چکیده
We investigate the effects of the δ transform on the partial sums of Fourier series for functions with a finite number of jumps, which in general, converge slowly. Although the δ process is known to accelerate convergence for many sequences, we prove that in this case, the transformed series will usually fail to converge to the original function. 2000 Mathematics Subject Classification: 65B10, 65T40, 42A20
منابع مشابه
Computation of Earthquake Response via Fourier Amplitude Spectra
A theoretical relation is presented between the seismological Fourier amplitude spectrumand the mean squared value of the elastic response, which is defined by Gaussian distribution. Byshifting a general process to its mean value, spectrum of the mean squared value of the displacementis computed from the Fourier amplitude spectrum and the real part of the relative displacementtransfer function ...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملNonharmonic Gabor Expansions
We consider Gabor systems generated by a Gaussian function and prove certain classical results of Paley and Wiener on nonharmonic Fourier series of complex exponentials for the Gabor expansion. In particular, we prove a version of Plancherel-Po ́lya theorem for entire functions with finite order of growth and use the Hadamard factorization theorem to study regularity, exactness and deficienc...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملA Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach
In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...
متن کامل